Analysis of scheduling problems with typed task systems
نویسندگان
چکیده
منابع مشابه
The complexity of scheduling typed task systems with and without communication delays
We consider the problem of scheduling typed task systems subject to precedence constraints and communication delays. For such task systems, the set of tasks is divided into sets of tasks of the same type and there are di erent types of processors. In a schedule for a typed task system, the type of a task must correspond to the type of the processor on which it is executed. It is proved that if ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملScheduling task systems with resources
Minimum execution time scheduling of task systems with resources has been the subject of several papers over the past few years. The model used for much of this work assumes that the resources in the system are continuous. That is, there is one unit of each resource, and a task may require any portion of that unit during its execution. While this is a reasonable assumption for certain bin packi...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملpre-scheduling and scheduling of task graph on homogeneous multiprocessor systems
task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90142-2